Stochastic Image Compression Using Fractals

نویسندگان

  • Aditya Kapoor
  • Kush Arora
  • Ajai Jain
  • G. P. Kapoor
چکیده

Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of such objects, Iterated Function Systems (IFS) {[3] , [1]} are recently being used. The main problem in fractal encoding using IFS is large amount of time taken for the compression of the fractal object. Our endeavor in the present paper is to use an stochastic algorithm to improve upon the compression time as well as compression ratio obtained in [1], while maintaining the image quality. Our results show that we are able to reduce time taken for compression of Image by 55% 80% and the size by 60% 80% as compared to the non-stochastic algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Fractals and Wavelets Leading to an Improved Image Compression Method

Fractal Compression relies on image self similarities at different regions . The self similarity provides an efficient way to code the image using the least possible parameters. The Wavelet Transform decomposes an image. The decomposed image is rich in self similarities. In this research we explore how the wavelet transform helps to produce a higher compression ratio when applied to the Iterate...

متن کامل

V-variable image compression

V-variable fractals, where V is a positive integer, are intuitively fractals with at most V different “forms” or “shapes” at all levels of magnification. In this paper we describe how V-variable fractals can be used for the purpose of image compression.

متن کامل

Application of Uniform Quantization and Huffman Coding to the Iterated Block Matching Fractals for Image Compression

The concept of Fractals dates back to Mandelbrot [1]. Improvements were achieved by other researchers such as Barnsley and Jaquin [2],[3]. In this work, the Iterated Block Matching Fractals (IBMF) [4] software is being coded using Uniform Quantization (UQ) and Huffman Coding (HC). Theoretical description of each coding method is presented using examples. The IBMF output parameters are coded usi...

متن کامل

Pavement Distress Images Using Fractals

The vast amount of data generated by automated surface distress evaluation equipment far exceeds the storage capabilities of current digital data storage systems. A study using fractals is being carried out to alleviate the data storage problem, since fractal image compression offers the largest compression ratio of the available image compression algorithms. This paper discusses the use of fra...

متن کامل

Generation of 3D Fractal Images for Mandelbrot and Julia Sets

Fractals provide an innovative method for generating 3D images of real-world objects by using computational modelling algorithms based on the imperatives of self-similarity, scale invariance, and dimensionality. Images such as coastlines, terrains, cloud mountains, and most interestingly, random shapes composed of curves, sets of curves, etc. present a multivaried spectrum of fractals usage in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003